Compressed Index for a Dynamic Collection of Texts

Dynamic FM-Index for a Collection of Texts with Application to Space-efficient Construction of the Compressed Suffix Array

A compressed dynamic self-index for highly repetitive text collections

We present a novel compressed dynamic self-index for highly repetitive text collections. Signature encoding, an existing self-index of this type, has a large disadvantage of slow pattern search for short patterns. We obtain faster pattern search by leveraging the idea behind a truncated suffix tree (TST) to develop the first compressed dynamic self-index, called the TST-index, that supports not...

Self-Index based on LZ77 (thesis)

Domains like bioinformatics, version control systems, collaborative editing systems (wiki), and others, are producing huge data collections that are very repetitive. That is, there are few differences between the elements of the collection. This fact makes the compressibility of the collection extremely high. For example, a collection with all different versions of a Wikipedia article can be co...

Dynamic Modelling of a Compressed Air Energy Storage System in a Grid Connected Photovoltaic Plant

The use of photovoltaic (PV) cells in domestic and industrial applications has grown rapidly through the recent years. Constructing PV plants is a very smart measure to produce free electricity in large scales, especially in the countries with higher solar irradiation potential. On the other hand, compressed air energy storage (CAES) has already been proposed to be employed for energy storage a...

Indexing Compressed Text

As a result of the rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we review and test some of the more effective and some of the more theoretically inter...